Scheduling system and scheduling method for the same

ABSTRACT

A scheduling system may include a read sequence management table that includes a group of positions for arranging data received from a group of lines and a schedule management table to store a group of peak rate values that are each associated with one of the group of positions of the read sequence management table. The scheduling system may further include a schedule computation section to determine the association between each of the group of peak rate values and the group of positions based on an availability of the group of positions, store each of the associations in the schedule management table, and select one of the group of positions in the read sequence management table as a starting position to arrange data from a new line, where the selected position is based on a comparison of a peak rate value of the new line and the group of peak rate values stored in the schedule management table.

RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.11/350,101 filed Feb. 9, 2006, now U.S. Pat. No. 7,602,715, which is acontinuation of U.S. patent application Ser. No. 09/974,793 filed Oct.12, 2001, now U.S. Pat. No. 7,031,315, the entire contents of which areincorporated by reference herein.

FIELD OF THE INVENTION

The invention relates to the control of cell read in an ATM(asynchronous transfer mode) line, and more particularly to a schedulingsystem for efficiently reading each cell and a scheduling method for thesame.

BACKGROUND OF THE INVENTION

ATM (asynchronous transfer mode) is a communication system for sendingor receiving at a high speed all data, to be transmitted, which havebeen divided into units called “cells” of 53 octets (one octet=8 bits).ATM is suitable for the transfer of large-capacity data, such asmultimedia data, and constitutes a basic technique of broadband ISDN.

In ATM, multiplex communication is carried out, and, in addition, thetransmission rate can be regulated at a desired value by setting thenumber of cells sent per given time (cell rate) to a desired value. Byvirtue of this, even when voices (audio), static images, moving imagesand the like are present together in an object to be sent, the objectcan be properly transmitted.

An ATM switch performs large-capacity, high-speed digital switching andmediates communication between terminals. An example of switchingconducted by the ATM switch is to cell multiplex a plurality of ATMlines into a single physical transmission path followed by send of themultiplexed cells.

In this case, regarding the sequence of read of data in each ATM line(i.e., the sequence of send of cell in each line), also from theviewpoint of sending data at a proper speed, in sending cells, theindividual cells should be dispersed, if possible, at equal spacings, soas to avoid the send of cells in the concentrated state at a time in thesame line according to the rate of each line.

For example, in the control of send of cells using a time slot fordesignating the sequence of send of the individual cells, for example,in order to reduce a burst property at an output port in each ATM line,scheduling should be carried out to properly allocate the individualcells in the same line to respective positions dispersed within the timeslot.

For each line. PCR (peak cell rate) is used as a value for designatingthe maximum speed for sending the cells in the line. PCR indicates themaximum speed at which cells can be transferred in ATM. Further, theminimum spacing for transferring the cells in the same line isdetermined by the PCR value. Hereinafter, the term “PCR value” in thepresent specification is used for indicating the number of cells whichcan be transferred within one time slot in each line. That is, forexample, in a line such that the PCR value is “4,” four cells can besent per turn of the time slot.

An example of a conventional technique for allocating cells in each linerespectively to positions dispersed within the time slot will beexplained. FIG. 4 is a diagram illustrating an example of a conventionalscheduling technique for allocating individual cells respectively topositions dispersed within a time slot, wherein the length of the timeslot is 16.

At the outset, a cell read sequence management table is provided whichis a table having a length corresponding to the maximum number of cellsallocable to the time slot (hereinafter, this number of cells isreferred to as STENO).

Elements, the number of which is equal to the number of cellstransferred within one time slot in each data to be transferred (thatis, corresponding to the PCR value of each data), are ensured togetherwithin the cell read sequence management table. In the example shown inFIG. 4, the PCR value of ATM lines (or data to be transferred) indicatedby “A” and “B” is “2,” the PCR value of “C” is “1,” and the elements aresuccessively ensured from the head element within the cell read sequencemanagement table.

In the time slot, slots respectively to which the cells are allocatedare designated corresponding to the sequence of individual elements inthe cell read sequence management table, and the cells in each line tobe sent are allocated respective to the designated positions. In theexample shown in FIG. 4, the cells of “A” are allocated to slotscorresponding to numbers 1 and 2, and the cells of “B” are allocated toslots corresponding to numbers 3 and 4.

In the time slot, the cells allocated to the respective slots aresuccessively sent clockwise. That is, in the sequence in the cell readsequence management table, 1, 9, 5, 13, . . . are sent in that order.Thus, the cells in the same line are sent in the dispersed state. Forexample, in FIG. 4, the two cells in “A” or “B” are allocated topositions which face each other within the time slot. Therefore, at arate for sending the two cells in one turn, the cells are successivelysent at equal spacing.

Thus, scheduling of the cell read sequence management table based on thePCR value in each ATM line in a service object followed by the controlof read according to the scheduled cell read sequence management tablecan ensure the transfer rate in the transfer of each cell in each ATMline of the service object.

Successive positions in the sequence within the cell read sequencemanagement table can be converted to respective positions dispersedwithin the time slot, for example, by the following method.

FIG. 2 shows an example of calculation in a method for converting thepositions of the cell read sequence management table to respectivepositions within the time slot, and FIG. 3 shows a list of the resultsof the conversion.

In this example, a time slot length of 16 is taken as an example. Thesame is true of other cases where the length is a value obtained byraising 2 to the nth power wherein n is an integer (for example, 32, 64,. . . etc.). Here the length of the cell read sequence management tableis equal to the length of the time slot, and thus can be expressed interms of binary number of which the number of digits is calculated byequation log 2 L wherein L is the length of the table. In this example,log 2 (16)=4 (digits).

As shown in FIG. 2, “1” is first subtracted from each value in thesequence, and the value thus obtained is expressed in terms of binarynumber of four digits. The numerical values (“0” or “1”) of theindividual digits expressed in terms of binary number are converted soas to be reversed in sequence. That is, MOB (most significant bit) sideand LSB (least significant bit) side in the value expressed in terms ofbinary number of four digits are reversed in sequence to obtain a newbinary number. “1” is added to the binary number thus obtained todetermine a value which is regarded us the corresponding time slotposition.

For example, in the “8th” within the cell read sequence managementtable, the subtraction of “1” from this value followed by the expressionof the obtained value in terms of a four-digit binary number gives“0111” (=7). These individual digits are rearranged so as to be reversedin sequence to give a value of “1110” (=14). Finally, “1” is added tothin value to obtain the corresponding time slot position “15” as theconversion result.

Here values obtained by raising 2 to the nth power, wherein n is aninteger, are used as the maximum rate (PCR value) of the band in eachservice ATM line, and the cell read sequence management table isscheduled based on the PCR values. The use of values obtained by raising2 to the nth power, wherein n is an integer, (i.e., 1, 2, 4, 8, . . .etc.) as the PCR value is common in the art. In this method, theproperties of the binary number can be utilized, and the processing canbe simplified.

In particular, this conversion method is suitable in the case where, inthe cell read sequence management table, elements corresponding to thePCR value (value obtained by raising 2 to the nth power wherein n is aninteger) are continuously ensured from a position which is one ahead ofthe position corresponding to a value obtained by multiplying the PCRvalue by an integer, that is, a position which is next to the positioncorresponding to a value obtained by multiplying the PCR value by aninteger. The elements, which have been ensured here, are dispersed atequal spacings in the time slot. Further, ensuring the elementscorresponding to the PCR value (value obtained by raising 2 to the nthpower wherein n is an integer) from one ahead of the positioncorresponding to a value obtained by multiplying the PCR value by aninteger can be simply achieved by arranging the elements correspondingto the PCR value in each line in the descending order of the PCR valuesfrom the head.

For example, in the example shown in FIG. 4, the three lines “A,” “B,”and “C” having respective PER values of “2,” “2,” and “1” aresuccessively arranged in the descending order of the PCR values toensure the elements corresponding to the PCR values in the cell readsequence management table. This permits the elements to be allocated atequal spacings to the time slot, whereby cells in each line are sent atequal intervals.

Further, to the contrary, in the prior art, in order to transfer cellssent from each line at an even rate, in the cell read sequencemanagement table, the elements for each line are successively arrangedso that the PCR values are in descending order by the above method.

In the ATM switch which transfers cells in each of the ATM lines,however, data is not always sent at a stationary data transfer rate.That is, in some cases, the transfer of data is ended halfway in eachline, or, on the contrary, in some cases, in each line, new datatransfer is started.

For this reason, in the conventional ATM switch, as described above, theindividual lines are scheduled from the head of the cell read sequencemanagement table in the descending order of PCR values and, at the sametime, so as to avoid the occurrence of an unused idle area betweenlines, and the positions of each line within the cell read sequencemanagement table are properly updated.

Next, a conventional scheduling system will be explained wherein a cellread sequence management table is scheduled by the above method.

FIG. 6 is a block diagram showing the construction of a schedulingsystem 10 a for controlling the read of cells in a conventional ATMline.

Referring now to FIG. 6, in a conventional scheduling system 100 a, datareceived in a line setting interface 10 is first supplied to a schedulecomputation section 20 a, and calculation for scheduling of the cellread management table is executed.

An allocation processor 30 sets, in a time slot 40, the result ofscheduling calculated by the schedule computation section 20 a. In otherwords, the allocation processor 30 converts the individual elements inthe cell read management table to respective positions in the time slot40 by the conversion method shown in FIGS. 2 and 3.

Shaping service, which has assured the rate of each ATM line, can becarried out by reading an ATM line, input into the device, from aconnection input queue 50 to a shaping service output queue 60 accordingto the time slot setting.

The construction and operation of the conventional schedule computationsection 20 a shown in FIG. 6 are as follows.

Specifically, data sent from the line setting interface 10 is processedin a parameter processor, and is output to a schedule object computationsection. Upon new receive of line or delete of line, the schedule objectcomputation section computes a line, in the cell read sequencemanagement table, of which the position is to be changed. In theconventional schedule computation section 20, ATM lines as the schedulechange object are a part of lines having the same PCR value as PCRvalues of lines, of which a line is to be newly received or deleted, andall of lines having a smaller PCR value.

A schedule clear section clears the cell read sequence management tableof which the schedule is to be changed. The schedule computation sectionperforms scheduling in the descending order of PCR values of lines(i.e., a line having a larger PCR value among the lines as the computedschedule change object is scheduled in an earlier stage) in a successivemanner from the head of idle areas in the cell read sequence 125management table. The reason for this is that scheduling in thedescending order of PCR values of lines can provide better receiveefficiency of the cell read sequence management table from the viewpointof assuring the rate of ATM lines to be shaped.

Further, as described above, when PCR values are values obtained byraising 2 to the nth power, wherein n is an integer, scheduling in thedescending order of PCR values of lines (i.e., a line having a largerPCR value is scheduled in an earlier stage) from the head of idle areasin the cell read sequence management table can ensure positions assuringthe rate in the cell read management table.

Here when lines have not been aligned, that is, when the individuallines have been successively scheduled from the head in idle areas ofthe cell read sequence management table without alignment, however, thearrangement of lines in the descending order is broken and,consequently, there is a fear of the assurance of line rate being lost.

FIG. 5 is a diagram illustrating the read of cells in the case where thearrangement of lines in descending order in a cell read sequencemanagement table has been broken. In FIG. 5, three lines shown in FIG. 4are arranged in the order of “C,” “A,” and “B,” that is, in the order ofPCR values “1,” “2,” and “2.” Unlike the example of FIG. 4 in whichcells have been sent at equal intervals, in the lines “A” and “B,” cellsare sent at uneven intervals which do not satisfy a send intervalrequirement indicated by the PCR value.

Therefore, in the prior art, when a schedule is newly received orchanged, as described above, the individual lines as the processingobject should be aligned.

As described above, in the conventional scheduling system, every timewhen a change has occurred in a line to be cataloged in the cell readsequence management table, troublesome processing should be carried outsuch that all the cataloged lines are aligned in the descending order ofPCR values and rearranged from the head.

An example of a conventional measure devised to deal with this problemis as follows. In order that, among lines cataloged in the cell readsequence management table, lines having a larger PCR value than the PCRvalue of the line, in which the change has occurred, do not undergo achange in the position within the cell read sequence management tableupon the rescheduling, the object of the position conversion processingis limited only to a part of lines having the same PCR value as the PCRvalue of the line, in which the change has occurred, and all the lineshaving smaller PCR values than the line, in which the change hasoccurred, followed by computation of rescheduling. Even when the objectof the rescheduling is limited to a narrower range in this way, however,there remains the necessity of executing troublesome processing suchthat, every time when a change, such as new addition of a line, hasoccurred, the lines are aligned and rearranged.

SUMMARY OF THE INVENTION

Accordingly, it is a first object of the invention to provide ascheduling system, which can solve the above problems of the prior artand, without requiring, for example, complicate construction andcomplicate processing, can assure the rate of each line and can executehigh-speed, high-capacity data transfer, and a scheduling method forsaid scheduling system.

It is a second object of the invention to provide a scheduling system,which can solve the above problems of the prior art and cansignificantly reduce the necessity of update of the cell read sequencemanagement table through the provision of an additional table forproperly managing and updating positions of individual lines within thecell read sequence management table, and a scheduling method for saidscheduling system.

According to the first feature of the invention, a scheduling systemcomprises:

a time slot for specifying the transfer sequence of individual lines inone turn, in which each cell is transferred, in slots indicatingrespective points in the turn;

a cell read sequence management table which has elements in the samenumber as the number of slots provided in the time slot and sets thelines as cell transfer objects to the elements;

schedule computation means for controlling the setting of the lines tothe cell read sequence management table;

allocation processing means for converting the elements of the cell readsequence management table respectively to specified positions of theslots in the time slot; and

a schedule management table for indicating positions, within the cellread sequence management table, to which transfer object lines are newlyset, for each PCR value of the lines, said PCR value being the number ofcells, transferred from the line, per cell transfer turn andrepresenting the cell send rate of each line,

the specified line cells being successively transferred for each turnaccording to the sequence specified in the time slot,

the cell read transfer sequence in each line being controlled accordingto the cell send rate in each of the lines.

In the scheduling system according to the first feature of theinvention, the schedule computation means preferably comprises:

means which, when a requirement is satisfied such that there is an idleelement, in the cell read sequence management table, which is locatedone element ahead of a position of an element corresponding to a valueobtained by multiplying the specified PCR value by an integer, and thecontemplated line can be set to continuous elements starting from theidle element and corresponding to the specified PCR value and, inaddition, when an element is present in the heading area of thecontinuous elements, functions to catalog the position of said element,which is located one element ahead of a position of an elementcorresponding to a value obtained by multiplying the specified PCR valueby an integer, as data indicating the set position of the line havingthe specified PCR value, in relation with the PCR value in the schedulemanagement table;

means which, when a line to be newly transferred has occurred, newlysets the line to continuous elements corresponding to the PCR value ofthe line, in the cell read sequence management table, from the setposition corresponding to the PCR value of the line recorded in theschedule management table;

means which, when the communication of a line being currentlytransferred has been deleted, cancels the setting of the line from theelement, in the cell read sequence management table, to which the linehas been set; and

means which, when new setting or delete of a transfer object line hasoccurred, updates the catalog of the schedule management table.

In the scheduling system according to the first feature of theinvention, the allocation processing means preferably comprises:

means which converts the elements within the cell read sequencemanagement table, to respective specified positions within the timeslot, based on the designation of the slot position as the conversiondestination for each element specified in such a manner that thecontinuous elements corresponding to the PCR value, that have beenensured from a position which is one element ahead of a position of anelement corresponding to a value obtained by multiplying the PCR valueby an integer, in the cell read sequence management table are convertedto respective positions dispersed at equal spacings in the time slot;and

means which, when a line is in the state of being set to elements in thecell read sequence management table, performs specifying and setting, ina slot as the conversion destination of the line in the time slot, so asto transfer cells of the line.

In the scheduling system according to the first feature of theinvention, preferably, the number of slots in the time slot and the PCRvalue of each of the lines each are a value obtained by raising “2” tothe nth power, wherein n is a non-negative integer.

In the scheduling system according to the first feature of theinvention, preferably,

the conversion from the cell read sequence management table to the rimeslot is carried out by a method comprising the steps of:

raising “2” to the “Ath” power, wherein “A” is an integer, to provide avalue as the length of the time slot;

indicating the positions of the individual elements in the cell readsequence management table and the slot positions of the time slot byusing continuous numbers from “1” to the value of the time slot length;

taking each element from the cell read sequence management table;

subtracting “1” from the value of the continuous numbers in the elementand expressing the obtained value in terms of binary number of “A”digits while, when a high order value is absent, supplementing “0”;

converting the numerical values of the “A” digits expressed in terms ofbinary number so as to be reversed in sequence with respect to thearrangement from higher order digit to lower order digit to provide aconverted binary number of “A” digits; and

adding “1” to the value of the converted binary number of “A” digits todetermine a value as a slot position, in the time slot, which is theelement conversion destination.

In the scheduling system according to the first feature of theinvention, preferably, the schedule computation means performs afunction such that, upon the cancellation of the setting of a line fromthe elements in the cell read sequence management table, if another linehaving a smaller PCR value than said line is in the state of being setto a position behind the position to which the said line has been set,the set position of said another line is moved to the position fromwhich the setting of said line has been cancelled.

In the scheduling system according to the first feature of theinvention, preferably, the schedule computation means performs afunction such that, upon the cancellation of the setting of a line fromthe elements in the cell read sequence management table, if other lineshaving a smaller PCR value than said line are in the state of being setto positions behind the position to which the said line has been set,the set position of one line, which has the largest PCR value in saidother lines and is located in the rearmost position of said other lines,is moved to the position from which the setting of said line has beencancelled.

In the scheduling system according to the first feature of theinvention, the line may be an ATM line.

According to the second feature of the intention, a scheduling methodcomprises the steps of:

indicating the send rate or cells in each line in terms of PCR valuewhich is the number of cells, transferred from the line, per celltransfer turn;

successively transferring cells of a specified line according to thesequence specified in slots, in a time slot for specifying the transfersequence of individual lines in the cell transfer turn, indicating eachpoint in the turn;

controlling the setting of each line in a cell read sequence managementtable which has elements in the same number as the number of slotsprovided in the time slot and sets the lines as cell transfer objects tothe elements;

converting the individual elements in the cell read sequence managementtable to respective specified slot positions in the time slot; and

properly updating and making reference to a schedule management tablewhich indicates positions, within the cell read sequence managementtable, to which transfer object lines are newly set, for each PCR valueof the lines,

the cell read transfer sequence in each line being controlled accordingto the cell send rate in each of the lines.

The scheduling method according to the second feature of the inventionmay further comprise the steps of:

when a requirement is satisfied such that there is an idle element, inthe cell read sequence management table, which is located one elementahead of a position of an element corresponding to a value obtained bymultiplying the specified PER value by an integer, and the contemplatedline can be set to continuous elements starting from the idle elementand corresponding to the specified PCR value and, in addition, when anelement is present in the heading area of the continuous elements,cataloging the position of said element, which is located one elementahead of a position of an element corresponding to a value obtained bymultiplying the specified PCR value by an integer, as data indicatingthe set position of the line having the specified PCR value within thecell read sequence management table, in relation with the PCR value inthe schedule management table;

when a line to be newly transferred has occurred, newly setting the lineto continuous elements corresponding to the PCR value of the line, inthe cell read sequence management table, from the set positioncorresponding to the PCR value of the line recorded in the schedulemanagement table;

when the communication of a line being currently transferred has beendeleted, canceling the setting of the line from the element, in the cellread sequence management table, to which the line has been set; and

when new setting or delete of a transfer object line has occurred,updating the catalog of the schedule management table.

The scheduling method according to the second feature of the inventionmay further comprise the steps of:

converting the elements within the cell read sequence management table,to respective specified positions within the time slot, based on thedesignation of the slot position as the conversion destination for eachelement specified in such a manner that the continuous elementscorresponding to the PCR value, that have been ensured from a positionwhich is one element ahead of a position of an element corresponding toa value obtained by multiplying the PCR value by an integer, in the cellread sequence management table are converted to respective positionsdispersed at equal spacings in the time slot; and

when a line is in the state of being set to elements in the cell readsequence management table, performing specifying and setting, in a slotas the conversion destination of the line in the time slot, so as totransfer cells of the line.

In the scheduling method according to the second feature of theinvention, preferably, the number of slots in the time slot and the PCRvalue of each of the lines each are a value obtained by raising “2” tothe nth power, wherein n is a non-negative integer.

In the scheduling method according to the second feature of theinvention, preferably,

the conversion from the cell read sequence management table to the timeslot is carried out by a method comprising the steps of:

raising “2” to the “Ath” power, wherein “A” is an integer, to provide avalue as the length of the time slot;

indicating the positions of the individual elements in the cell readsequence management table and the slot positions of the time slot byusing continuous numbers from “1” to the value of the time slot length;

taking each element from the cell read sequence management table;

subtracting “1” from the value of the continuous numbers in the elementand expressing the obtained value in terms of binary number of “A”digits while, when a high order value is absent, supplementing “0”;

converting the numerical values of the “A” digits expressed in terms ofbinary number so as to be reversed in sequence with respect to thearrangement from higher order digit to lower order digit to provide aconverted binary number of “A” digits; and

adding “1” to the value of the converted binary number of “A” digits todetermine a value as a slot position, in the time slot, which is theelement conversion destination.

In the scheduling method according to the second feature of theinvention, preferably, upon the cancellation of the setting of a linefrom the elements in the cell read sequence management table, if anotherline having a smaller PCR value than said line is in the state of beingset to a position behind the position to which the said line has beenset, the set position of said another line is moved to the position fromwhich the setting of said line has been cancelled.

In the scheduling method according to the second feature of theinvention, preferably, upon the cancellation of the setting of a linefrom the elements in the cell read sequence management table, if otherlines having a smaller PCR value than said line are in the state ofbeing set to positions behind the position to which the said line hasbeen set, the set position of one line, which has the largest PCR valuein said other lines and is located in the rearmost position of saidother lines, is moved to the position from which the setting of saidline has been cancelled.

In the scheduling method according to the second feature of theinvention, the line may be an ATM line.

According to the third feature of the invention, an ATM switch comprisesa scheduling system such that the cell read transfer sequence in eachATM line is controlled according to the cell send rate in each of theATM lines, wherein

said scheduling system

expresses the cell send rate, in each of the ATM lines, in terms of PCRvalue, which is the number of cells, transferred from the ATM line, percell transfer turn and comprises:

a time slot for specifying the transfer sequence of the ATM lines in oneturn, in which each cell is transferred, in slots indicating respectivepoints in the turn;

a cell read sequence management table which has elements in the samenumber as the number of slots provided in the time slot and sets the ATMlines as cell transfer objects to the elements;

schedule computation means for controlling the setting of the ATM linesto the cell read sequence management table;

allocation processing means for converting the elements of the cell readsequence management table respectively to specified positions of theslots in the time slot; and

a schedule management table for indicating positions, within the cellread sequence management table, to which transfer object ATM lines arenewly set, for each PCR value of the ATM lines,

the specified ATM line cells being successively transferred for eachturn according to the sequence specified in the time slot.

In the ATM switch according to the third feature of the invention,preferably, the schedule computation means comprises:

means which, when a requirement is satisfied such that there is an idleelement, in the cell read sequence management table, which is locatedone element ahead of a position of an element corresponding to a valueobtained by multiplying the specified PCR value by an integer, and thecontemplated ATM line can be set to continuous elements starting fromthe idle element and corresponding to the specified PCR value and, inaddition, when an element is present in the heading area of thecontinuous elements, functions to catalog the position of said element,which is located one element ahead of a position of an elementcorresponding to a value obtained by multiplying the specified PCR valueby an integer, as data indicating the set position of the ATM linehaving the specified PCR value, in relation with the PCR value in theschedule management table;

means which, when an ATM line to be newly transferred has occurred,newly sets the ATM line to continuous elements corresponding to the PCRvalue of the ATM line, in the cell read sequence management tabled fromthe set position corresponding to the PCR value of the ATM line recordedin the schedule management table;

means which, then the communication of an ATM line being currentlytransferred has been deleted, the setting of the ATM line is cancelledfrom the element, in the cell read sequence management table, to whichthe ATM line has been set; and

means which, when new setting or delete of a transfer object ATM linehas occurred, updates the catalog of the schedule management table.

In the ATM switch according to the third feature of the invention,preferably, the allocation processing means comprises:

means which converts the elements within the cell read sequencemanagement table, to respective specified positions within the timeslot, based on the designation of the slot position as the conversiondestination for each element specified in such a manner that thecontinuous elements corresponding to the PCR value, that have beenensured from a position which is one element ahead of a position of anelement corresponding to a value obtained by multiplying the PCR valueby an integer, in the cell read sequence management table are convertedto respective positions dispersed at equal spacings in the time slot;and

means which, when an ATM line is in the state of being set to elementsin the cell read sequence management table, performs specifying andsetting, in a slot as the conversion destination of the ATM line in thetime slot, so as to transfer cells of the ATM line.

In the ATM switch according to the third feature of the invention,preferably, the number of slots in the time slot and the PCR value ofeach of the ATM lines each are a value obtained by raising “2” to thenth power, wherein n is a non-negative integer.

In the ATM switch according to the third feature of the invention,preferably,

the conversion from the cell read sequence management table to the timeslot is carried out by a method comprising the steps of:

raising “2” to the “Ath” power, wherein “A” is an integer, to provide avalue as the length of the time slot;

indicating the positions of the individual elements in the cell readsequence management table and the slot positions of the time slot byusing continuous numbers from “1” to the value of the time slot length;

taking each element from the cell read sequence management table;

subtracting “1” from the value of the continuous numbers in the elementand expressing the obtained value in terms of binary number of “A”digits while, when a high order value in absent, supplementing “0”;

converting the numerical values of the “A” digits expressed in terms ofbinary number so as to be reversed in sequence with respect to thearrangement from higher order digit to lower order digit to provide aconverted binary number of “A” digits; and

adding “1” to the value of the converted binary number of “A” digits todetermine a value as a slot position, in the time slot, which is theelement conversion destination.

In the ATM switch according to the third feature of the invention,preferably, the schedule computation means performs a function suchthat, upon the cancellation of the setting of an ATM line from theelements in the cell read sequence management table, if another ATM linehaving a smaller PCR value than said ATM line is in the state of beingset to a position behind the position to which the said ATM line hasbeen set, the set position of said another ATM line is moved to theposition from which the setting of said ATM line has been cancelled.

In the ATM switch according to the third feature of the invention,preferably, the schedule computation means performs a function suchthat, upon the cancellation of the setting of an ATM line from theelements in the cell read sequence management table, if other ATM lineshaving a smaller PCR value than said ATM line are in the state of beingset to positions behind the position to which the said ATM line has beenset, the set position of one ATM line, which has the largest PCR valuein said other ATM lines and is located in the rearmost position of saidother ATM lines, is moved to the position from which the setting of saidATM line has been cancelled.

BRIEF DESCRIPTION OF THR DRAWINGS

The invention will be explained in more detail in conjunction with theappended drawings, wherein;

FIG. 1 is a diagram showing an example of conventional scheduling of acell read sequence management table;

FIG. 2 is a diagram showing an example of computation in a method forconverting individual positions in a cell read sequence management tablerespectively to positions within a time slot;

FIG. 3 is a diagram showing a list of conversion results obtained by thecomputation method shown in FIG. 2;

FIG. 4 is a diagram illustrating an example of scheduling for allocatingindividual cells respectively to positions dispersed within a time slot;

FIG. 5 is a diagram illustrating the read of cells in the case where thearrangement of lines in descending order has been broken in theconventional cell read sequence management table:

FIG. 6 is a block diagram showing the construction of a conventionalscheduling system;

FIG. 7 is a block diagram showing the construction of a schedulingsystem according to a first preferred embodiment of the invention;

FIG. 8 is a diagram showing an example of a cell read sequencemanagement table in the first preferred embodiment of the invention;

FIG. 9 is a diagram showing an example of a schedule management table inthe first preferred embodiment of the invention;

FIG. 10 is a flow chart illustrating an example of line receiveprocessing in the first preferred embodiment of the invention;

FIG. 11 is a flow chart illustrating an example of line deleteprocessing in the first preferred embodiment of the invention;

FIG. 12 is a diagram illustrating an example or update of a parameterfor managing idle areas in the first preferred embodiment of theinvention;

FIG. 13 is a diagram illustrating an example of computation of aposition correction value with the movement of the position in the firstpreferred embodiment of the invention;

FIG. 14 in a diagram illustrating an example of the movement of a moveobject line in the first preferred embodiment of the invention:

FIG. 15 is a diagram illustrating an example of the correction ofallocation position of a schedule management parameter in the firstpreferred embodiment of the invention; and

FIG. 16 is a diagram showing an example of scheduling of a cell readsequence management table in the first preferred embodiment of theinvention.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

Preferred embodiments of the invention will be explained in detail inconjunction with the accompanying drawings.

FIG. 7 is a block diagram showing the construction of a schedulingsystem in a first preferred embodiment of the invention.

The scheduling system according to this preferred embodiment of theinvention is a system which manages the sequence of the read of cellsfor each ATM line, for example, in an ATM switch. In this system, eachline is properly set in a cell read sequence management table forsetting the sequence of the read of cells, thereby managing the sequenceof the read of cells.

Further, as explained below, each line is efficiently set in the cellread sequence management table to realize the update of the cell readsequence management table by minimized processing, even in anenvironment such that the receive or delete of lines is repeatedlycarried out.

Referring now to FIG. 7, a scheduling system 100 according to thispreferred embodiment comprises a line setting interface 10, a schedulecomputation section 20, an allocation processor 30, and a time slot 40,and receives a connection input queue 50 and outputs a shaping serviceoutput queue 60. Each of these sections can realize, for example, usinga semiconductor circuit or the like for executing the processing of eachof the sections. The scheduling system 100 shown in FIG. 7 is differentfrom the conventional scheduling system 100 a shown in FIG. 6 mainly ina schedule computation section 20 and its processing which will beexplained later.

FIG. 8 is a diagram showing an example of a cell read sequencemanagement table in the first preferred embodiment of the invention.

According to the scheduling system in this preferred embodiment, theschedule computation section 20 performs control in such a manner thatindividual lines are ensured, based on PCR values (obtained by raising 2to the nth power wherein n is an integer), in the cell read sequencemanagement table from its position which is one ahead of the positioncorresponding to a value obtained by multiplying the PCR value by aninteger. The ensured individual lines are converted according to themethod for convention to a time slot exemplified in FIGS. 2 and 3, andcells in the lines are read and transferred in the converted sequence inthe time slot. As described above in the column of the background of theinvention, the elements of the lines ensured from the position, which isone ahead of the position corresponding to a value obtained bymultiplying the PCR value by an integer, as described above inconnection with the example shown in FIG. 8, are positioned at equalspacings within the time slot, and, thus, proper transfer of cellsaccording to the send rate of each line can be realized.

When the line can be ensured in a plurality of sites, the line isensured in the first site (the smallest number site). In this case,since a wide unused area is ensured in the rear part of the table,subsequent new lines can be efficiently ensured.

Here in the conventional scheduling system 10 a, when the receive ordelete of a line has occurred, all the positions of the lines in thecell read sequence management table should be aligned. This is necessaryfor properly ensuring the lines from the position which is one ahead ofthe position corresponding to a value obtained by multiplying the PCRvalue by an integer.

By contrast, in the scheduling system in the present preferredembodiment, proper line scheduling can be realized, without necessity ofalignment processing, by the provision of a schedule management tableshowing proper allocation positions based on the PCR values of the linesand the arrangement of the lines in designated positions of the table,rather than the adoption of the method wherein the lines are aligned inthe descending order of PCR values.

FIG. 9 is a diagram showing an example of a schedule management table,in the present preferred embodiment, with respect to the example of thecell read sequence management table shown in FIG. 8. In FIG. 9, PCRvalues of lines are shown in the column of “EN,” and proper allocationpositions corresponding respectively to the PCR values of the lines areshown in the column of “FEP.”

Here, as described above, the proper allocation positions of the linesin the schedule management table begin from the position which is oneahead of the position corresponding to a value obtained by multiplyingthe PCR value of the line by an integer and, at the same time, has thesmallest number.

The line having a PCR value of “1” can be allocated to the “8th”position of the cell read sequence management table, and the line havinga PCR value of “2” can be allocated to the “15th” position of the cellread sequence management table. Lines hating a PCR value of “4” or morecannot be allocated to idle areas between other lines and are allocatedfrom the “25th” position which is the final position.

When a new line has been positioned based on the schedule managementtable or when a line has been deleted, the schedule computation section20 updates the values in the cell read sequence management table. Theupdate of the schedule management table is much simpler than theconventional alignment processing which requires the operation of thecell read sequence management table per se. Therefore, a significantreduction in processing necessary for scheduling can be realized.

Thus, in the scheduling system according to this preferred embodiment,the use of the schedule management table permits the lines to beproperly ensured from the position, which is one ahead of the positioncorresponding to a value obtained by multiplying the PCR value of theline by an integer, without the necessity of alignment of the cell readsequence management table.

In the cell read sequence management table in this preferred embodiment,as is apparent from the example shown in FIG. 8, even when an idle areahas occurred between the ensured line areas or even when the arrangementin the descending order of PCR values of the cells has been broken,there is no need to execute the processing of alignment of the lines.

When there is an idle area between the ensured line areas, however, themovement of a line in the rear part of the cell read sequence managementtable so as to fill the idle area permits a wider unused area to beensured in the rear part. Therefore, such move processing is useful.Accordingly, in an example which is effective in this preferredembodiment, the following method is considered. At the time of thedelete of a line from the cell read sequence management table, when anidle area has occurred between the lines or when the idle area has beenexpanded, a search is made for whether or not there is a line, which canfill the idle area, behind the idle area. When the contemplated line ispresent, the line is moved into the idle area to fill the idle area orto narrow the idle area. The processing for moving one line in thismethod is much simpler than the processing for aligning all the lines.Therefore, in addition to the effect of reducing scheduling, the effectof ensuring a wider unused area can be attained.

In another example, a method is also considered wherein, when a line isnewly cataloged in the cell read sequence management table or when theline in the above example is moved, only a line having the longest PCRvalue, which can be cataloged in the idle area, is cataloged in the idlearea between the ensured line areas. That is, in the example shown inFIG. 8, a line having a PCR value of “2” can be cataloged in idle areaslocated at the 15th to 16th positions, and, thus, even when the idlearea located at the 8th position has already been filled, a line havinga PCR value of “1” is cataloged in the 25th position, which is the finalposition, rather than the idle area located at the 15th position. Thiscan be realized, in the same manner as in the above examples, throughthe determination of each value of the schedule management table by theschedule computation section 20 so as to realize the above scheduling.

Next, the operation of an example of the scheduling system according tothe present preferred embodiment, including computation processing inthe schedule computation section 20, will be explained in detail.

Various parameters, which the schedule computation section 20 uses forthe computation of schedule, will be first explained.

As shown in FIG. 7, the internal schedule computation section in theschedule computation section 20 is provided with a schedule managementtable. As explained above, the schedule management table is a tablewhich, for each type of PCR value “EN” (here 1, 2, 4, 8), shows theoptimal position “FEP” in the case of the receive of new lines. Thereceive of the individual lines in respective positions indicated inthis table can assure the send rate of the lines.

Further, the schedule computation section 20 has, as parameters, thetotal number of entries “TEN” indicating the length of the cell roadsequence management table, the total number of used entries “TUEN”indicating the total number of entries, in the cell read sequencemanagement table, to which lines have been allocated, and the final boxnumber “TUEB” indicating the cell read sequence management table in itsrear end to which the line has been allocated. The schedule computationsection 20 manages these values and updates these parameters accordingto the update of the cell read sequence management table.

For example, in the example shown in FIG. 8, the value of the totalnumber of entries “TEN” is “32,” the value of the total number of usedentries “TUEN” is “21,” and the value of the final box number “TUEB” is“24.”

Further, for the explanation of the processing in the schedulecomputation section 20, “A,” “B,” “C,” “D,” “E,” and “F” each are usedas variables of integers for indicating internal parameters.

FIG. 10 is a flow chart for explaining processing for newly receiving aline within the cell read sequence management table according to thescheduling system in the present example, and FIG. 11 is a flow chartfor explaining processing for deleting a line from within the cell readsequence management table. In the flow charts, the square brackets areused for indicating a value obtained by omitting decimals of thenumerical value within the square brackets (for example, [ 5/2]=2).

The operation of the receive of a line will be explained in conjunctionwith the flow chart shown in FIG. 10.

In the operation of receive of the line, whether or not the object linecan be received within the cell read sequence management table is judgedbased on the PCR value “EN” of the line to be received. The object lineto be received is cataloged in an idle area between the alreadycataloged lines or in an unused area at the end.

At the outset, judgment is made on whether or not an idle area, whichcan receive a line requested to be received, is present within thealready scheduled cell read sequence management table (step 401).

When the judgment is such that an idle area corresponding to the objectline is present, corresponding data “PEP” is read from the schedulemanagement table and is decided as an allocation position of the linewithin the cell read sequence management table, followed by theallocation of the line to the position (step 402). This updates the cellread sequence management table, and, hence, the corresponding update isperformed on the schedule management table (step 403).

In the case where the judgment on the receive of the line in an idlearea is such that the line cannot be received in the idle area and, atthe same time, the judgment on the receive of the line in an unused areain the cell read sequence management table (step 404) is such that theline cannot be received (step 405), the receive of the line is judged tobe impossible followed by the end of the line receive processing.

Here there is a case where, even though the receive of a line in theidle area is impossible, the allocation of the line to an unused areahas been judged to be possible. In this case, a position in the unusedarea, which can receive the line and is suitable for the receive of theline (that is, a position which is one ahead of the positioncorresponding to a value obtained by multiplying the PCR value by aninteger), is computed (step 406), and is decided as a position forreceiving the object line (step 407). After the decision of the linereceive position, the schedule management table is updated.

As described in each of the above examples, the schedule managementtable is updated so that each line is allocated by a desired method. Inthis example, the schedule computation section 20 executes the followingupdate processing.

Parameters for managing a new idle area produced after the receive of aline are first updated as shown in FIG. 12 (steps 408 to 414).

Specifically, an idle area after the receive of a line is computedfollowed by substitution of the computation result for a parameter “C”(step 408), and the following processing is carried out one by one fromlines of a smaller band than the PCR value of the received line “EN” indescending order (step 409).

At the outset, a judgment is made on whether or not the line having thePCR value can be received in the computed idle area (steps 410 and 411).When the judgment is such that the line can be received, the allocationposition and the idle area are updated (step 412) followed by thecataloging of the position as the allocation position BEEPS of the linehaving the PCR value “EN” in the schedule management table (step 413).

In the case where the judgment on whether or not the line can bereceived is such that the receive is impossible and, at the same time,the connection has been judged to be final (that is, the PCR value is“1”) (step 414), the total number of used entries “TUEN” and the finalbox number “TUEB” are updated (step 415) to complete the line receiveprocessing.

Next, the operation in the delete of a line will be explained withreference to the flow chart shown in FIG. 11.

In the operation in the delete of a line, the line requested to bedeleted is first deleted from the allocation position of the line “SOE”(step 501).

Next, the allocation move processing of the scheduled lines within thecell read sequence management table upon the delete of a line will beexplained in various classified cases.

Here a judgment is made on whether or not an idle area corresponding tothe deleted line is present within the cell read management table (stop503). When the judgment is such that the idle area is present, aposition correction value derived from the location movement is computedas shown in FIG. 13 (steps 504 to 507). Here the idle area correspondingto the line is in a state shown in FIG. 13 according to the condition inthe step S05. Therefore, the allocation position after the locationmovement is corrected as indicated in the step 506 or step 507.

After the computation of the position correction value, the object lineis moved as shown in FIG. 14 (steps 508 and 509). In this case, thecondition in the step 508 is established when the length of the line tobe moved is identical to the length of the deleted line. When thecondition in the step 508 is not established, branching is performedwithout the movement of the line.

When the location move processing has been carried out, due to theupdate of the cell read sequence management table caused by the locationmovement, the values of the schedule management table are updated asshown in FIG. 15 (steps 510 to 516). In the update of the schedulemanagement table, when the position of an idle area has been moved bythe move processing (steps 511 and 512), the allocation position withinthe schedule management table is corrected (step 513). The above updateis sequentially carried out in the descending order of PCR values oflines (step 515).

After the completion of the move processing, a larger idle area isensured, and, consequently, in some cases, the location movement of alarger-band line can be realized. In this case, the PCR value of theline is updated, and the above procedure is then repeated (step 516).

In the branch in the step 503, when any idle area corresponding to theobject line is not present within the cell read sequence managementtable, the next line receive position is updated (step 517), and ajudgment on location movement is made (step 518). Specifically, in thecase where, after the line delete processing (step 518), the locationmovement of the line is impossible and there is no change in the finalbox number “TUEB,” the total number of used entries is updated tocomplete line delete processing (step 528).

On the other hand, when the delete of a line in accompanied by locationmovement, the move processing is carried out (step 520). In this case,however, when the object line to be deleted is located at the rear endof the final box number, the move processing is not carried out (step519). The update of the schedule management parameters after thelocation move processing (steps 521 to 526) is the same as that in thesteps 510 to 516.

After the completion of the update of the schedule managementparameters, the total number of used entries “TUEN” and the final boxnumber “TUEB” are updated to complete the line delete processing (step527).

As explained above, according to the scheduling system of this preferredembodiment, the position of individual lines in the cell read sequencemanagement table can be properly allocated by simple processing.

In the present preferred embodiment, the conversion method exemplifiedin FIGS. 2 and 3 is used in the conversion of the lines, located at therespective positions in the cell read sequence management table, to atime slot. However, when the lines are continuously ensured from aposition which is one ahead of the position corresponding to a valueobtained by multiplying the PCR value by an integer, the conversionmethod for dispersing the ensured elements at equal spacings in the timeslot is not limited to the method shown in FIGS. 2 and 3, and FIGS. 2and 3 merely illustrate one example of possible conversion methods.

In this connection, it should be noted that, in all the above-describedexamples, the scheduling method for a cell read sequence managementtable according to the scheduling system of the present preferredembodiment is not influenced by the method for converting lines to atime slot, and the same effect can be attained even when otherconversion methods satisfying the above requirement for conversion to atime slot are adopted.

As described above, the scheduling system according to the invention hasthe following effects.

According to the scheduling system of the invention, in a cell readsequence management table for assuring the rate of ATM lines andmanaging the transfer of cells, making reference to a schedulemanagement table permits the position of each line to be properlydetermined based on the PCR value of the line. Therefore, in thescheduling system of the invention, satisfying the requirements whichhave been necessary in the prior art technique, for example, therequirement for alignment in the descending order of PCR values and therequirement for the avoidance of the creation of any idle area betweenlines, is not required, and, thus, in the invention, scheduling can berealized in a proper and more flexible manner.

In the conventional scheduling system, in order to assure the rate ofindividual ATM lines, for example, in newly receiving a line or deletinga line, scheduling should be carried out in the descending order of PCRvalues and so that no idle area is provided between lines. For thiareason, in the prior art technique, every time when the receive of a newline, the delete of a line or the like had occurred, troublesome updateprocessing should be carried out wherein the individual lines arealigned and rearranged.

The use of the scheduling system according to the invention cansubstantially eliminate the need to perform alignment and otherprocessing every time, for example, when a line has been newly received.

Processing, in the case where newly receiving a line and deleting a lineare repeatedly carried out, according to the invention may be comparedwith processing, in the case where newly receiving a line and deleting aline are repeatedly carried out, according to the prior art technique bycomparing FIG. 16 (invention) with FIG. 1 (prior art technique). In bothFIGS. 16 and 1, identical processings for the add or delete ofconnection indicated from the top to the bottom in the left-side columnare carried out. The comparison shows that, in the scheduling systemaccording to the invention, the number of objects to be location movedis significantly reduced as compared with that in the prior arttechnique.

For example, in newly receiving a line, in the prior art technique, apart of other connections having a PCR value equal to the contemplatedconnection and all of connections having a smaller PCR value than thecontemplated connection should be moved, whereas, in the schedulingsystem according to the invention, there is no need to move theconnections.

On the other hand, in deleting a line, in the prior art, a part of otherconnections having a PCR value equal to the contemplated connection andall of connections having a smaller PCR value than the contemplatedconnection should be moved, whereas, in the scheduling system accordingto the invention, what is required is only to move one connection havinga PCR value equal to or larger than the contemplated connection.

Further, also in the unused (free) area within the cell read sequencemanagement table, the invention has no disadvantage over the prior arttechnique.

This is apparent from FIG. 16 (example of invention) and FIG. 1 (exampleof prior art) which each show a table illustrating conversion to thenumber of lines having PCR values obtained by raising 2 to the nthpower, wherein n is an integer, in the unused area within the cell readsequence management table. The comparison of FIG. 16 with FIG. 1 showsthat, in the scheduling system according to the invention, the samequantity of line as the prior art technique can be newly received ineach step of this example.

As is apparent from the foregoing description, the use of the schedulingsystem according to the invention can significantly reduce theprocessing necessary for scheduling while realizing the same linecapacity as the prior art technique.

The invention has been described in detail with particular reference topreferred embodiments, but it will be understood that variations andmodifications can be effected within the scope of the invention as setforth in the appended claims.

1. A scheduling system, comprising: a read sequence management tableincluding a plurality of positions for arranging data received from aplurality of lines; a schedule management table to store a plurality ofpeak rate values that are each associated with one of the plurality ofpositions of the read sequence management table; and a schedulecomputation section to: determine the association between each of theplurality of peak rate values and the plurality of positions based on anavailability of the plurality of positions, store each of theassociations in the schedule management table, and select one of theplurality of positions of the read sequence management table as astarting position to arrange data from a new line, where the selectedposition is based on a comparison of a peak rate value of the new lineand the plurality of peak rate values stored in the schedule managementtable.
 2. The scheduling system of claim 1, where the associations arefurther based on a quantity of available positions, of the plurality ofpositions, that are contiguous.
 3. The scheduling system of claim 1,where a match between one of the plurality of peak rate values stored inthe schedule management table and the peak rate value of the new linecauses the schedule computation section to select the position that isassociated with the matched peak rate value in the schedule managementtable.
 4. The scheduling system of claim 3, where the selected positioncorresponds to an idle position in the read sequence management tablethat is located between previously arranged data received from differentlines.
 5. The scheduling system of claim 3, where the selected positioncorresponds to an unused position in the read sequence management table,where the unused position is located after a last position in the readsequence management table that includes previously arranged datareceived from a line of the plurality of lines.
 6. The scheduling systemof claim 1, where each time data for an additional new line is arrangedin the read sequence management table, the schedule computation sectionmodifies at least one of the plurality of positions associated with apeak rate value stored in the schedule management table.
 7. Thescheduling system of claim 1, further comprising: an allocationprocessor to convert each of the plurality of positions in the readsequence management table to one of a plurality of corresponding slotsin a time slot.
 8. A scheduling system comprising: a read sequencemanagement table including a plurality of positions for arranging datareceived from a plurality of lines; a schedule management table to storea plurality of peak rate values that are each associated with one of theplurality of positions of the read sequence management table; and aschedule computation section to: determine the association between eachof the plurality of peak rate values and the plurality of positionsbased on an availability of the plurality of positions, and store eachof the associations in the schedule management table, where at least oneof the associations between one of the plurality of positions and one ofthe plurality of peak rates values stored in the schedule managementtable is determined by multiplying the peak rate value by an integer toobtain a multiplication result and adding one to the multiplicationresult.
 9. A scheduling method, comprising: providing a plurality ofpositions for arranging data received from a plurality of lines in aread sequence management table; providing a schedule management table tostore a plurality of peak rate values that are each associated with oneof the plurality of positions of the read sequence management table;determining, with a schedule computation section, the associationbetween each of the plurality of peak rate values and the plurality ofpositions based on an availability of the plurality of positions;storing, with the schedule computation section, each of the associationsin the schedule management table, and selecting, with the schedulecomputation section, one of the plurality of positions of the readsequence management table as a starting position to arrange data from anew line, where the selected position is based on a comparison of a peakrate value of the new line and the plurality of peak rate values storedin the schedule management table.
 10. The scheduling method of claim 9,where the associations are further based on a quantity of availablepositions, of the plurality of positions, that are contiguous.
 11. Thescheduling method of claim 9, where a match between one of the pluralityof peak rate values stored in the schedule management table and the peakrate value of the new line causes the schedule computation section toselect the position that is associated with the matched peak rate valuein the schedule management table.
 12. The scheduling method of claim 11,where the selected position corresponds to an idle position in the readsequence management table that is located between previously arrangeddata received from different lines.
 13. The scheduling method of claim11, where the selected position corresponds to an unused position in theread sequence management table, where the unused position is locatedafter a last position in the read sequence management table thatincludes previously arranged data received from a line of the pluralityof lines.
 14. The scheduling method of claim 9, further comprising:modifying, with the schedule computation section, at least one of thepositions associated with a peak rate value stored in the schedulemanagement table each time data for an additional new line is arrangedin the read sequence management table.
 15. The scheduling method ofclaim 9, further comprising: converting each of the plurality ofpositions in the read sequence management table to one of a plurality ofcorresponding slots in a time slot.
 16. A scheduling method comprising:providing a plurality of positions for arranging data received from aplurality of lines in a read sequence management table; providing aschedule management table to store a plurality of peak rate values thatare each associated with one of the plurality of positions of the readsequence management table; determining, with a schedule computationsection, the association between each of the plurality of peak ratevalues and the plurality of positions based on an availability of theplurality of positions; and storing, with the schedule computationsection, each of the associations in the schedule management table,where at least one of the associations between one of the plurality ofpositions and one of the plurality of peak rates values stored in theschedule management table is determined by multiplying the peak ratevalue by an integer to obtain a multiplication result and adding one tothe multiplication result.
 17. A system comprising: a network device to:provide a plurality of positions for arranging data received from aplurality of lines; determine an association between each of a pluralityof peak rate values and one of the plurality of positions based on anavailability of the plurality of positions; store the associationbetween each of the plurality of peak rate values and one of theplurality of positions, and select one of the plurality of positions asa starting position to arrange data from a new line, where the selectedposition is based on a comparison of a peak rate value of the new lineand the plurality of stored peak rate values.
 18. The system of claim17, where the associations are further based on a quantity of availablepositions, of the plurality of positions, that are contiguous.
 19. Thesystem of claim 17, where at least one of the associations between oneof the plurality of peak rates values and one of the plurality ofpositions is determined by multiplying the peak rate value by an integerto obtain a multiplication result and adding one to the multiplicationresult.